Workshop on Voronoi Methods for Handling Geographic Data Spatial Adjacency as the Basis for Spatial Data Structures
نویسنده
چکیده
This review is intended to supplement the Spatial Data Handling Symposium Workshop by giving the main lines of argument leading to the development of the Voronoi spatial model. Three points will be emphasized. Firstly, the objects used to create a seamless data structure (i.e. one without holes or joins) are themselves discrete, even if the world they came from is not. Secondly, a flexible data structure should be "dynamic", permitting the immediate insertion and deletion of individual map objects without destroying the underlying spatial linkages (which would then require a complete "rebuild" operation for even small changes). Thirdly, and perhaps most importantly, there are other ways of thinking about spatial data structures than the raster model, or the point/line/polygon model of the last fifteen years.
منابع مشابه
Surface interpolation, spatial adjacency and GIS
Spatial information may be viewed in two ways: as coordinates measured with a ruler along imaginary axes; or as the adjacency relationships between objects. The former has been the most common historically, but the latter appears more relevant to the handling of spatially distributed objects in a computer. The interpolation problem, as implemented using weighted-average techniques, depends on t...
متن کاملProblems with Handling Spatial Data
Experience with the handling of spatial data on a computer led to the identification of a variety of ‘'awkward” problems, including interpolation, error estimation and dynamic polygon building and editing. Many of the problems encountered could be classified as “‘spatial adjacency” issues. The Voronoi diagram of points and line segments in the Euclidean plane is shown to give a functional defin...
متن کاملVoronoi Diagrams and Spatial Adjacency
One of the basic concerns of Geographic Information Systems and their application is the spatial relationships between objects on the map. This has been attacked from two directions: by the construction/linking of polygon boundary segments; and by including spatial operators within data-base retrieval requests. In both cases only an incomplete picture has been obtained due to the lack of any co...
متن کاملDynamic Spatial Data Structures - the Voronoi Approach
Voronoi diagrams have recently received attention as data structures containing significant information about the spatial adjacency of map objects. Despite their theoretical efficiency, batch construction techniques require complete rebuilding after each modification. Incremental Voronoi creation methods use processes such as insert, delete and move for points, and from these derive insertion a...
متن کاملSpatial Adjacency - a General Approach
It is fact universally acknowledged that discrete computing systems are ill-equipped to process vector-based spatial information: inexact line intersection calculations and similar geometric (co-ordinate) operations can not readily guarantee consistent graphical structures (topology). It is proposed here that use of Voronoi diagrams, especially euclidean-distance nearest-object Voronoi diagrams...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003